function [pathBetweenTwoNodes] = anotherBackupPath(copyBackupPathTable, disp_loc, matrix, sender, receiver, node)
            
            neighborsS = zeros(1,1);            
            neighborsClosestNode = zeros(1,1);           
           [neighborsS] = node_neighbors(sender,matrix);%This function will return the neighbors for certain node.         
           closestNode = getClosestNode(sender, receiver, neighborsS, disp_loc);           
           pathBetweenTwoNodes = zeros(1,1);
           counter = 1;
           pathBetweenTwoNodes(counter) = sender;
           counter = counter +1;
           pathBetweenTwoNodes(counter) = closestNode;
           counter = counter + 1;
           commonNode = -1;   
            % In order to find the node that geographically comman between the node which is closest to the sender and common with the receiver.                
           [commonNode,closestNode] = getCommonNode(copyBackupPathTable, pathBetweenTwoNodes,closestNode, receiver, matrix, disp_loc); 
          while commonNode == 0 
              if commonNode ~= node
                    pathBetweenTwoNodes(counter)= closestNode; 
                    tempClosestNode = closestNode;
                    counter = counter + 1; 
                    sender = closestNode;    
                    [neighborsS] = node_neighbors(sender,matrix);%This function will return the neighbors for certain node.         
                    closestNode = getClosestNode(sender, receiver, neighborsS, disp_loc);                            
                    % In order to find the node that geographically comman between the node which is closest to the sender and common with the receiver.                
                    [commonNode,closestNode] = getCommonNode(copyBackupPathTable, pathBetweenTwoNodes,closestNode, receiver, matrix, disp_loc); 
                    if commonNode ==0 && closestNode ~= tempClosestNode;
                        pathBetweenTwoNodes(counter)= tempClosestNode;                    
                        counter = counter + 1; 
                    end
              end
                
          end
           % The new path between B1 and B2 will be as in the following array
           if commonNode ~= -1 && commonNode ~= node
               pathBetweenTwoNodes(counter)= commonNode;    
               counter = counter + 1; 
           end
           pathBetweenTwoNodes(counter)= receiver;
end